School Timetabling in Theory and Practice A comparative study of Simulated Annealing and Tabu Search
نویسندگان
چکیده
School timetabling is way of distributing resources such as teachers and classrooms over a fixed period of time. This task can be difficult and very time-consuming. If the process of generating timetables is automated with the help of algorithms then this can help save both time and money for the educational institute. In this thesis a general timetable is presented along with a set of constraints commonly used in school timetabling. Two meta heuristic algorithms with previous satisfying results, Simulated Annealing and Tabu Search, are implemented and benchmarked against each other in order to evaluate the performance of these. The results show that although both algorithms are good candidates for creating timetables, Simulated Annealing has the edge both in run time and the quality of the timetable.
منابع مشابه
Timetabling at German Secondary Schools: Tabu Search versus Constraint Programming
In recent years many solution approaches for different school timetabling problems (TTP) have been tried, among them tabu search, simulated annealing, genetic algorithms, and constraint programming [8]. However, most of the solution methods developed so far have been tested by means of only few (mostly only a handful) problem instances [6]. Further, until today there are nearly no reports on te...
متن کاملA genetic algorithm selection perturbative hyper-heuristic for solving the school timetabling problem
Research in the domain of school timetabling has essentially focused on applying various techniques such as integer programming, constraint satisfaction, simulated annealing, tabu search and genetic algorithms to calculate a solution to the problem. Optimization techniques like simulated annealing, tabu search and genetic algorithms generally explore a solution space. Hyper-heuristics, on the o...
متن کاملComparison of Simulated Annealing, Genetic, and Tabu Search Algorithms for Fracture Network Modeling
The mathematical modeling of fracture networks is critical for the exploration and development of natural resources. Fractures can help the production of petroleum, water, and geothermal energy. They also greatly influence the drainage and production of methane gas from coal beds. Orientation and spatial distribution of fractures in rocks are important factors in controlling fluid flow. The obj...
متن کاملA Case Based Heuristic Selection investigation of Hill Climbing, Simulated Annealing and Tabu Search for Exam Timetabling Problems
The examination timetabling problem has been studied in many different forms and using a variety of techniques over the years [1], [3], [4], [6]. In its simplest form, it is required that a set of exams are scheduled into a set of time periods in such a way that no two exams with students in common are scheduled at the same time. In practice there are a wide range of other constraints which mus...
متن کاملSolving an one-dimensional cutting stock problem by simulated annealing and tabu search
A cutting stock problem is one of the main and classical problems in operations research that is modeled as Lp < /div> problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms, namely simulated annealing (SA) and tabu search (TS), are proposed and deve...
متن کامل